(s,lnκ)-weak tractability of linear problems
نویسندگان
چکیده
منابع مشابه
Uniform Weak Tractability of Multivariate Problems
In this dissertation we introduce a new notion of tractability which is called uniform weak tractability. We give necessary and sufficient conditions on uniform weak tractability of homogeneous linear tensor product problems in the worst case, average case and randomized settings. We then turn to the study of approximation problems defined over spaces of functions with varying regularity with r...
متن کاملGeneralized Tractability for Multivariate Problems Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted Tractability
We continue the study of generalized tractability initiated in our previous paper “Generalized tractability for multivariate problems, Part I: Linear tensor product problems and linear information”, J. Complexity, 23, 262-295 (2007). We study linear tensor product problems for which we can compute linear information which is given by arbitrary continuous linear functionals. We want to approxima...
متن کاملGeneralized tractability for multivariate problems Part I: Linear tensor product problems and linear information
Many papers study polynomial tractability for multivariate problems. Let n(ε, d) be the minimal number of information evaluations needed to reduce the initial error by a factor of ε for amultivariate problem defined on a space of d-variate functions. Here, the initial error is the minimal error that can be achieved without sampling the function. Polynomial tractability means that n(ε, d) is bou...
متن کاملTractability of multivariate analytic problems
In the theory of tractability of multivariate problems one usually studies problems with finite smoothness. Then we want to know which s-variate problems can be approximated to within ε by using, say, polynomially many in s and ε−1 function values or arbitrary linear functionals. There is a recent stream of work for multivariate analytic problems for which we want to answer the usual tractabili...
متن کاملNotes on (s, t)-weak tractability: A refined classification of problems with (sub)exponential information complexity
In the last 20 years a whole hierarchy of notions of tractability was proposed and analyzed by several authors. These notions are used to classify the computational hardness of continuous numerical problems S = (Sd)d∈N in terms of the behavior of their information complexity n(ε, Sd) as a function of the accuracy ε and the dimension d. By now a lot of effort was spend on either proving quantita...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2017
ISSN: 0885-064X
DOI: 10.1016/j.jco.2016.10.008